Pseudorandom Number Generators Based on the Weyl Sequence
نویسنده
چکیده
Some modifications of the pseudorandom number generator proposed recently by Holian et al. [B. L. Holian, O. E. Percus, T. T. Warnock, P. A. Whitlock, Phys. Rev. E50, 1607 (1994)] are presented.
منابع مشابه
3 Generators Split Combination Srand48 Run Q Bits the Parallel Sequence Test Results for the Explicit Inversive Congruential Generator
Table 4 The parallel sequence test results for the Split Multiplicative Linear Congruential Combination geneator and Srand48 other consists of the even terms fX 2 (k) = srand48(2k) j k = 1; 2; g. Each stream is further split into sequences of length of 1,000,000. One sequence from each stream in the corresponding order is chosen to form a pair of sequences. Two experiments were performed and de...
متن کاملOn cryptographic properties of LFSR-based pseudorandom generators
Pseudorandom generators (PRGs) are used in modern cryptography to transform a small initial value into a long sequence of seemingly random bits. Many designs for PRGs are based on linear feedback shift registers (LFSRs), which can be constructed in such a way as to have optimal statistical and periodical properties. This thesis discusses construction principles and cryptanalytic attacks against...
متن کاملStatistical Analysis of Pseudorandom Binary Sequences Generated by Using Tent Map
The paper presents a detailed analysis of two types of pseudorandom binary sequence generators obtained by using tent map. The test is performed using a NIST statistical test suite which is widely used for testing the randomness of any random number generator. The binary sequences under investigation are obtained either by considering all the successive iterations of the tent map and choosing a...
متن کاملOn the Use of Cellular Automata in Symmetric Cryptography
In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear cellular automata. The algorithm that converts the given generator into a linear model based on automata is very simple and is based on the concatenation of a bas...
متن کاملOn the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials
Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and MonteCarlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004